Six Ways of Integrating Symmetries within Non-overlapping Constraints
نویسندگان
چکیده
This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ways deal with the conjunction of a chain of lexicographic ordering constraint and a non-overlapping or a cumulative constraint. Experiments on academic two and three dimensional placement problems as well as on industrial problems show the benefit of such a strong integration of symmetry breaking constraints and non-overlapping ones.
منابع مشابه
Symmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. This simple but powerful idea can be used in a number of different ways. We describe one application within model restarts, a search technique desi...
متن کاملIncreasing Symmetry Breaking by Preserving Target Symmetries
Breaking the exponential number of all symmetries of a constraint satisfaction problem is too costly. In practice, we often aim at breaking a subset of the symmetries efficiently, which we call target symmetries. In static symmetry breaking, the goal is to post a set of constraints to break these target symmetries in order to reduce the solution set and thus also the search space. Symmetries of...
متن کاملPolynomial and non-polynomial solutions set for wave equation with using Lie point symmetries
This paper obtains the exact solutions of the wave equation as a second-order partial differential equation (PDE). We are going to calculate polynomial and non-polynomial exact solutions by using Lie point symmetry. We demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation. A generalized procedure for polynomial solution is pr...
متن کاملStructural and evolutionary tunnels of pairwise residue-interaction symmetries connect different structural classes of proteins
Studying all non-redundant proteins in 76 most-commonly found structural domains, we decipher latent patterns that characterize acceptable and unacceptable symmetries in residue-residue interactions in functional proteins. Cutting across the structural classes, a select set of pairwise interactions are found to be universally favored by geometrical and evolutionary constraints; these symmetric ...
متن کاملBreaking symmetries in all different problems
Adding symmetry breaking constraints is one of the oldest ways of breaking variable symmetries for CSPs. For instance, it is well known that all the symmetries for the pigeon hole problem can be removed by ordering the variables. We have generalized this result to all CSPs where the variables are subject to an all different constraint. In such case it is possible to remove all variable symmetri...
متن کامل